class Solution {
public:
    int findPeakElement(vector<int>& nums) {
        int left = 0, right = nums.size() - 1, mid = 0;
        while(left < right)
        {
            //mid = left + (right - left) / 2;
            mid = left + (right - left + 1) / 2;
            //if(nums[mid] < nums[mid + 1])
            if(nums[mid - 1] < nums[mid])
            {
                //left = mid + 1;
                left = mid;
            }
            else
            {
                //right = mid;
                right = mid - 1;
            }
        }
        return left;
        //return left;
    }
};
